Bigraphical Refinement

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bigraphical Refinement

We propose a mechanism for the vertical refinement of bigraphical reactive systems, based upon a mechanism for limiting observations and utilising the underlying categorical structure of bigraphs. We present a motivating example to demonstrate that the proposed notion of refinement is sensible with respect to the theory of bigraphical reactive systems; and we propose a sufficient condition for ...

متن کامل

Bigraphical Nets

Interaction nets are a graphical model of computation, which has been used to define efficient evaluators for functional calculi, and specifically λ -calculi with patterns. However, the flat structure of interaction nets forces pattern matching and functional behaviour to be encoded at the same level, losing some potential parallelism. In this paper, we introduce bigraphical nets, or binets for...

متن کامل

Developing Bigraphical Languages

In this dissertation, we study bigraphical languages—languages based on the theory for bigraphs and bigraphical reactive systems developed by Milner and coworkers. We begin by examining algebraic theory for binding bigraphs. We give a term language for binding bigraphs and develop a complete axiomatization of structural equivalence. Along the way, we develop a set of normal form theorems, which...

متن کامل

Towards a Bigraphical Encoding of Actors

Actors are self-contained, concurrently interacting entities of a computing system. They can perform local computations, communicate via asynchronous message passing with other actors and can be dynamically created. Bigraphs are a fully graphical process algebraic formalism, capable of representing both the position in space of agents and their inter-connections. Their behaviour is specified by...

متن کامل

Bigraphical Logics for XML

Bigraphs are emerging as an interesting model that can represent both the picalculus and the ambient calculus. Bigraphs are built orthogonally on two structures: a hierarchical ‘place’ graph for locations and a ‘link’ (hyper-)graph for connections. In a previous work (submitted elsewhere and yet unpublished), we introduced a logic for bigraphical structures as a natural composition of a place g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science

سال: 2011

ISSN: 2075-2180

DOI: 10.4204/eptcs.55.2